Ratios of Norms for Polynomials and Connected n-width Problems
نویسندگان
چکیده
منابع مشابه
Ratios of Norms for Polynomials and Connected n-width Problems
Let G ⊂C be a bounded simply connected domain with boundary Γ and let E ⊂G be a regular compact set with connected complement. In this paper we investigate asymptotics of the extremal constants: χn = inf p∈Pkn sup q∈Pn−kn ||pq ||E ||pq ||Γ , n = 1,2, . . . , where ‖ ·‖K is the supremum norm on a compact set K ,Pm is the set of all algebraic polynomials of degree at most m, and kn/n→ θ ∈ [0,1] a...
متن کامل2 3 A pr 2 00 8 Ratios of Norms for Polynomials and Connected n - width Problems
Let G ⊂ C be a bounded simply connected domain with boundary Γ and let E ⊂ G be a regular compact set with connected complement. In this paper we investigate asymptotics of the extremal constants: χn = inf p∈Pkn sup q∈Pn−kn ||pq||E ||pq||Γ , n = 1, 2, . . . , where ‖ · ‖K is the supremum norm on a compact set K, Pm is the set of all algebraic polynomials of degree at most m, and kn/n → θ ∈ [0, ...
متن کاملsemi-analytical solution for static and forced vibration problems of laminated beams through smooth fundamental functions method
در این پایان نامه روش جدیدی مبتنی بر روش حل معادلات دیفرانسیل پارهای بر اساس روش توابع پایه برای حل مسایل ارتعاش اجباری واستاتیک تیرها و صفحات لایه ای ارایه شده است که می توان تفاوت این روش با روش های متداول توابع پایه را در استفاده از توابع هموار در ارضاء معادلات حاکم و شرایط مرزی دانست. در روش ارایه شده در این پایاننامه از معادله تعادل به عنوان معادله حاکم بر رفتار سیستم استفاده شده است که مو...
15 صفحه اولBounding connected tree-width
Diestel and Müller showed that the connected tree-width of a graph G, i. e., the minimum width of any tree-decomposition with connected parts, can be bounded in terms of the tree-width of G and the largest length of a geodesic cycle in G. We improve their bound to one that is of correct order of magnitude. Finally, we construct a graph whose connected tree-width exceeds the connected order of a...
متن کاملConnected tree-width
The connected tree-width of a graph is the minimum width of a treedecomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle. We further prove a connected analogue of the duality th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Analysis and Operator Theory
سال: 2008
ISSN: 1661-8254,1661-8262
DOI: 10.1007/s11785-008-0095-5